Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs
نویسندگان
چکیده
We prove that the problem of nding two minimum dominating sets (connected dominating sets or vertex clique covers) with minimum intersection is linearly solvable in interval graphs. Furthermore, the problem of deciding whether or not there exist two disjoint minimum dominating sets (connected dominating sets or vertex clique covers) is shown to be NP-hard for chordal graphs.
منابع مشابه
Dominating Set Counting in Graph Classes
We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the ti...
متن کاملDominating Cliques in Distance-Hereditary Graphs
1 I n t r o d u c t i o n A subset D C V is a dominating set in graph G = (V, E) iff for all vertices v E V \ D there is a vertex u E D with uv E E. It is a dominating clique in G iff D is a dominating set in G and a clique (i.e. for all u, v E D uv E E). There are many papers investigating the problem of finding minimum dominating sets in graphs with (and without) additional requirements to th...
متن کاملr-Dominating cliques in graphs with hypertree structure
Let G = (V, E) be an undirected graph and r be a vertex weight function with positive integer values. A subset (clique) D ~_ V is an r-dominat ing set (clique) in G ifffor every vertex v e V there is a vertex u e D with dist(u, v) <~ r(v). This paper contains the following results: (i) We give a simple necessary and sufficient condition for the existence of r-dominating cliques in the case of H...
متن کاملOptimization Problems in Multiple Subtree Graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of t-interval graphs, a generalization of interval graphs that has recently been studied from a combinatorial optimization point of view. We present approx...
متن کاملSome Algorithmic Results on Restrained Domination in Graphs
A set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained dominating set of minimum cardinality. Given a graph G, and a positive integer k, the RESTRAINED DOMINATION DECISION problem is to decide whether G has a restrained dominating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nord. J. Comput.
دوره 3 شماره
صفحات -
تاریخ انتشار 1996